Synthetic Control as Online Linear Regression
نویسندگان
چکیده
This paper notes a simple connection between synthetic control and online learning. Specifically, we recognize as an instance of Follow-The-Leader (FTL). Standard results in convex optimization then imply that, even when outcomes are chosen by adversary, predictions counterfactual for the treated unit perform almost well oracle weighted average units' outcomes. Synthetic on differenced data performs difference-in-differences, potentially making it attractive choice practice. We argue that this observation further supports use estimators comparative case studies.
منابع مشابه
Online Sparse Linear Regression
We consider the online sparse linear regression problem, which is the problem of sequentially making predictions observing only a limited number of features in each round, to minimize regret with respect to the best sparse linear regressor, where prediction accuracy is measured by square loss. We give an inefficient algorithm that obtains regret bounded by Õ( √ T ) after T prediction rounds. We...
متن کاملTuning as Linear Regression
We propose a tuning method for statistical machine translation, based on the pairwise ranking approach. Hopkins and May (2011) presented a method that uses a binary classifier. In this work, we use linear regression and show that our approach is as effective as using a binary classifier and converges faster.
متن کاملOnline Active Linear Regression via Thresholding
We consider the problem of online active learning to collect data for regression modeling. Specifically, we consider a decision maker with a limited experimentation budget who must efficiently learn an underlying linear population model. Our main contribution is a novel threshold-based algorithm for selection of most informative observations; we characterize its performance and fundamental lowe...
متن کاملSequential linear regression with online standardized data
The present study addresses the problem of sequential least square multidimensional linear regression, particularly in the case of a data stream, using a stochastic approximation process. To avoid the phenomenon of numerical explosion which can be encountered and to reduce the computing time in order to take into account a maximum of arriving data, we propose using a process with online standar...
متن کاملOnline Linear Regression using Burg Entropy
We consider the problem of online prediction with a linear model. In contrast to existing work in online regression, which regularizes based on squared loss or KL-divergence, we regularize using divergences arising from the Burg entropy. We demonstrate regret bounds for our resulting online gradient-descent algorithm; to our knowledge, these are the first online bounds involving Burg entropy. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Econometrica
سال: 2023
ISSN: ['0012-9682', '1468-0262']
DOI: https://doi.org/10.3982/ecta20720